An Incremental Knowledge Compilation in First Order Logic
نویسنده
چکیده
An algorithm to compute the set of prime implicates of a quantifierfree clausal formula X in first order logic had been presented in earlier work. As the knowledge base X is dynamic, new clauses are added to the old knowledge base. In this paper an incremental algorithm is presented to compute the prime implicates of X and a clause C from π(X) ∪ C. The correctness of the algorithm is also proved.
منابع مشابه
A New Method for Incremental Consequence-Finding
Consequence-finding is important to various reasoning problems, including knowledge compilation, abduction, nonmonotonic reasoning, and clause maintenance systems. The incremental version of the problem is also important because it is expensive to recompute a consequence set in response to the addition of new premises. In this paper, we present the first incremental consequencefinding method fo...
متن کاملKnowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since the most efficient reasoning methods are defined for propositional logic, while knowledge is most conveniently expressed within a first-order language. To obtain compact propositional representations, we employ techni...
متن کاملExact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case
Forward chaining is an inference algorithm based on modus ponens which is widely used but unfortunately incomplete with respect to the usual boolean logic. A solution to this incompleteness is to compile the knowledge base so that forward chaining becomes complete for any base of facts. This compilation is called achievement and was so far restricted to propositional calculus. In this paper, we...
متن کاملApplications of Automated Reasoning
This paper offers an informal overview and discussion on first order predicate logic reasoning systems together with a description of applications which are carried out in the Artificial Intelligence Research Group of the University in Koblenz. Furthermore the technique of knowledge compilation is shortly introduced.
متن کاملA New Method for Consequence Finding and Compilation in Restricted Languages
SFK (skip-filtered, kernel) resolution is a new method for finding "interesting" consequences of a first order clausal theory E, namely those in some restricted target language £T. In its more restrictive form, SFK resolution corresponds to a relatively efficient SAT method, directional resolution; in its more general form, to a full prime implicate algorithm, namely Tison’s. It generalizes bot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1110.6738 شماره
صفحات -
تاریخ انتشار 2011